Constructing NSSD Molecular Graphs
نویسندگان
چکیده
A graph is said to be non-singular if it has no eigenvalue equal to zero; otherwise it is singular. Molecular graphs that are non-singular and also have the property that all subgraphs of them obtained by deleting a single vertex are themselves singular, known as NSSD graphs, are of importance in the theory of molecular π-electron conductors; NSSD = non-singular graph with a singular deck. Whereas all non-singular bipartite graphs (therefore, the molecular graphs of all closed-shell alternant conjugated hydrocarbons) are NSSD, the non-bipartite case is much more complicated. Only a limited number of non-bipartite molecular graphs have the NSSD property. Several methods for constructing such molecular graphs are presented.
منابع مشابه
Constructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملOn Phase Based Stereo Matching and Its Related Issues
The paper focuses on the problem of the point correspondence matching in stereo images. The proposed matching algorithm is based on the combination of simpler methods such as normalized sum of squared differences (NSSD) and a more complex phase correlation based approach, by considering the noise and other factors, as well. The speed of NSSD and the preciseness of the phase correlation together...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملIncreased rate of catheter-related bloodstream infection associated with use of a needleless mechanical valve device at a long-term acute care hospital.
OBJECTIVE To determine whether introduction of a needleless mechanical valve device (NMVD) at a long-term acute care hospital was associated with an increased frequency of catheter-related bloodstream infection (BSI). DESIGN For patients with a central venous catheter in place, the catheter-related BSI rate during the 24-month period before introduction of the NMVD, a period in which a needle...
متن کاملFuzzy Forcing Set on Fuzzy Graphs
The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...
متن کامل